0.11/0.17	% Problem    : Vampire---4.8_31996 : TPTP v0.0.0. Released v0.0.0.
0.11/0.18	% Command    : run_E %s %d THM
0.17/0.39	% Computer : n008.cluster.edu
0.17/0.39	% Model    : x86_64 x86_64
0.17/0.39	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.17/0.39	% Memory   : 8042.1875MB
0.17/0.39	% OS       : Linux 3.10.0-693.el7.x86_64
0.17/0.39	% CPULimit   : 1440
0.17/0.39	% WCLimit    : 180
0.17/0.39	% DateTime   : Mon Jul  3 12:58:34 EDT 2023
0.17/0.39	% CPUTime    : 
0.40/0.58	Running higher-order theorem provingRunning: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox2/tmp/tmp.rdehqvlWea/Vampire---4.8_31996
0.40/0.58	# Version: 3.1pre001-ho
0.42/0.81	# Preprocessing class: HSLMSMSMLLLCHSA.
0.42/0.81	# Scheduled 5 strats onto 8 cores with 180 seconds (1440 total)
0.42/0.81	# Starting pre_casc_4 with 720s (4) cores
0.42/0.81	# Starting full_lambda_6 with 180s (1) cores
0.42/0.81	# Starting sh10 with 180s (1) cores
0.42/0.81	# Starting post_as_ho9 with 180s (1) cores
0.42/0.81	# Starting post_as_ho8 with 180s (1) cores
0.42/0.81	# pre_casc_4 with pid 32174 completed with status 0
0.42/0.81	# Result found by pre_casc_4
0.42/0.81	# Preprocessing class: HSLMSMSMLLLCHSA.
0.42/0.81	# Scheduled 5 strats onto 8 cores with 180 seconds (1440 total)
0.42/0.81	# Starting pre_casc_4 with 720s (4) cores
0.42/0.81	# SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
0.42/0.81	# Search class: HGUSM-FFLM31-DHSMMFBN
0.42/0.81	# partial match(3): HGUSM-FSLM31-DHSFFFBN
0.42/0.81	# Scheduled 6 strats onto 4 cores with 720 seconds (720 total)
0.42/0.81	# Starting new_bool_5 with 324s (1) cores
0.42/0.81	# Starting pre_casc_4 with 73s (1) cores
0.42/0.81	# Starting ehoh_best8_lambda with 81s (1) cores
0.42/0.81	# Starting new_bool_1 with 81s (1) cores
0.42/0.81	# new_bool_5 with pid 32180 completed with status 0
0.42/0.81	# Result found by new_bool_5
0.42/0.81	# Preprocessing class: HSLMSMSMLLLCHSA.
0.42/0.81	# Scheduled 5 strats onto 8 cores with 180 seconds (1440 total)
0.42/0.81	# Starting pre_casc_4 with 720s (4) cores
0.42/0.81	# SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
0.42/0.81	# Search class: HGUSM-FFLM31-DHSMMFBN
0.42/0.81	# partial match(3): HGUSM-FSLM31-DHSFFFBN
0.42/0.81	# Scheduled 6 strats onto 4 cores with 720 seconds (720 total)
0.42/0.81	# Starting new_bool_5 with 324s (1) cores
0.42/0.81	# Preprocessing time       : 0.006 s
0.42/0.81	# Presaturation interreduction done
0.42/0.81	
0.42/0.81	# Proof found!
0.42/0.81	# SZS status Theorem
0.42/0.81	# SZS output start CNFRefutation
0.42/0.81	thf(decl_22, type, is_of: $i > ($i > $o) > $o).
0.42/0.81	thf(decl_23, type, all_of: ($i > $o) > ($i > $o) > $o).
0.42/0.81	thf(decl_25, type, in: $i > $i > $o).
0.42/0.81	thf(decl_72, type, l_some: $i > ($i > $o) > $o).
0.42/0.81	thf(decl_77, type, e_is: $i > $i > $i > $o).
0.42/0.81	thf(decl_123, type, nat: $i).
0.42/0.81	thf(decl_124, type, n_is: $i > $i > $o).
0.42/0.81	thf(decl_127, type, n_some: ($i > $o) > $o).
0.42/0.81	thf(decl_142, type, n_pl: $i > $i > $i).
0.42/0.81	thf(decl_147, type, diffprop: $i > $i > $i > $o).
0.42/0.81	thf(decl_148, type, d_29_ii: $i > $i > $o).
0.42/0.81	thf(decl_149, type, iii: $i > $i > $o).
0.42/0.81	thf(decl_162, type, n_ts: $i > $i > $i).
0.42/0.81	thf(decl_189, type, frac: $i).
0.42/0.81	thf(decl_191, type, num: $i > $i).
0.42/0.81	thf(decl_192, type, den: $i > $i).
0.42/0.81	thf(decl_193, type, n_eq: $i > $i > $o).
0.42/0.81	thf(decl_194, type, moref: $i > $i > $o).
0.42/0.81	thf(decl_195, type, lessf: $i > $i > $o).
0.42/0.81	thf(decl_197, type, esk1_0: $i).
0.42/0.81	thf(decl_198, type, esk2_0: $i).
0.42/0.81	thf(decl_199, type, esk3_0: $i).
0.42/0.81	thf(decl_200, type, esk4_0: $i).
0.42/0.81	thf(def_e_is, axiom, ((e_is)=(^[X1:$i, X60:$i, X61:$i]:(((X60)=(X61))))), file('/export/starexec/sandbox2/tmp/tmp.rdehqvlWea/Vampire---4.8_31996', def_e_is)).
0.42/0.81	thf(def_diffprop, axiom, ((diffprop)=(^[X1:$i, X183:$i, X4:$i]:((n_is @ X1 @ (n_pl @ X183 @ X4))))), file('/export/starexec/sandbox2/tmp/tmp.rdehqvlWea/Vampire---4.8_31996', def_diffprop)).
0.42/0.81	thf(def_n_is, axiom, ((n_is)=(^[Z0/* 19 */:$i, Z1:$i]:(((Z0)=(Z1))))), file('/export/starexec/sandbox2/tmp/tmp.rdehqvlWea/Vampire---4.8_31996', def_n_is)).
0.42/0.81	thf(def_d_29_ii, axiom, ((d_29_ii)=(^[X1:$i, X184:$i]:((n_some @ (diffprop @ X1 @ X184))))), file('/export/starexec/sandbox2/tmp/tmp.rdehqvlWea/Vampire---4.8_31996', def_d_29_ii)).
0.42/0.81	thf(def_iii, axiom, ((iii)=(^[X1:$i, X185:$i]:((n_some @ (diffprop @ X185 @ X1))))), file('/export/starexec/sandbox2/tmp/tmp.rdehqvlWea/Vampire---4.8_31996', def_iii)).
0.42/0.81	thf(def_all_of, axiom, ((all_of)=(^[X3:$i > $o, X2:$i > $o]:(![X4:$i]:(((is_of @ X4 @ X3)=>(X2 @ X4)))))), file('/export/starexec/sandbox2/tmp/tmp.rdehqvlWea/Vampire---4.8_31996', def_all_of)).
0.42/0.81	thf(def_is_of, axiom, ((is_of)=(^[X1:$i, X2:$i > $o]:((X2 @ X1)))), file('/export/starexec/sandbox2/tmp/tmp.rdehqvlWea/Vampire---4.8_31996', def_is_of)).
0.42/0.81	thf(def_n_eq, axiom, ((n_eq)=(^[X1:$i, X218:$i]:((n_is @ (n_ts @ (num @ X1) @ (den @ X218)) @ (n_ts @ (num @ X218) @ (den @ X1)))))), file('/export/starexec/sandbox2/tmp/tmp.rdehqvlWea/Vampire---4.8_31996', def_n_eq)).
0.42/0.81	thf(def_moref, axiom, ((moref)=(^[X1:$i, X219:$i]:((d_29_ii @ (n_ts @ (num @ X1) @ (den @ X219)) @ (n_ts @ (num @ X219) @ (den @ X1)))))), file('/export/starexec/sandbox2/tmp/tmp.rdehqvlWea/Vampire---4.8_31996', def_moref)).
0.42/0.81	thf(def_n_some, axiom, ((n_some)=(l_some @ nat)), file('/export/starexec/sandbox2/tmp/tmp.rdehqvlWea/Vampire---4.8_31996', def_n_some)).
0.42/0.81	thf(def_lessf, axiom, ((lessf)=(^[X1:$i, X220:$i]:((iii @ (n_ts @ (num @ X1) @ (den @ X220)) @ (n_ts @ (num @ X220) @ (den @ X1)))))), file('/export/starexec/sandbox2/tmp/tmp.rdehqvlWea/Vampire---4.8_31996', def_lessf)).
0.42/0.81	thf(satz44, axiom, (all_of @ (^[X1:$i]:((in @ X1 @ frac))) @ (^[X1:$i]:((all_of @ (^[X291:$i]:((in @ X291 @ frac))) @ (^[X292:$i]:((all_of @ (^[X4:$i]:((in @ X4 @ frac))) @ (^[X4:$i]:((all_of @ (^[X10:$i]:((in @ X10 @ frac))) @ (^[X10:$i]:(((moref @ X1 @ X292)=>((n_eq @ X1 @ X4)=>((moref @ X4 @ X10)<=(n_eq @ X292 @ X10)))))))))))))))), file('/export/starexec/sandbox2/tmp/tmp.rdehqvlWea/Vampire---4.8_31996', satz44)).
0.42/0.81	thf(satz45, conjecture, (all_of @ (^[X1:$i]:((in @ X1 @ frac))) @ (^[X1:$i]:((all_of @ (^[X390:$i]:((in @ X390 @ frac))) @ (^[X391:$i]:((all_of @ (^[X4:$i]:((in @ X4 @ frac))) @ (^[X4:$i]:((all_of @ (^[X10:$i]:((in @ X10 @ frac))) @ (^[X10:$i]:(((lessf @ X1 @ X391)=>((n_eq @ X1 @ X4)=>((lessf @ X4 @ X10)<=(n_eq @ X391 @ X10)))))))))))))))), file('/export/starexec/sandbox2/tmp/tmp.rdehqvlWea/Vampire---4.8_31996', satz45)).
0.42/0.81	thf(c_0_13, plain, ((e_is)=(^[Z0/* 19 */:$i, Z1:$i, Z2:$i]:(((Z1)=(Z2))))), inference(fof_simplification,[status(thm)],[def_e_is])).
0.42/0.81	thf(c_0_14, plain, ((diffprop)=(^[Z0/* 19 */:$i, Z1:$i, Z2:$i]:((((Z0)=(n_pl @ Z1 @ Z2)))))), inference(fof_simplification,[status(thm)],[def_diffprop])).
0.42/0.81	thf(c_0_15, axiom, ((n_is)=(^[Z0/* 19 */:$i, Z1:$i]:(((Z0)=(Z1))))), inference(apply_def,[status(thm)],[def_n_is, c_0_13])).
0.42/0.81	thf(c_0_16, plain, ((d_29_ii)=(^[Z0/* 19 */:$i, Z1:$i]:((l_some @ nat @ (^[Z2/* 3 */:$i]:((((Z0)=(n_pl @ Z1 @ Z2))))))))), inference(fof_simplification,[status(thm)],[def_d_29_ii])).
0.42/0.81	thf(c_0_17, plain, ((diffprop)=(^[Z0/* 19 */:$i, Z1:$i, Z2:$i]:((((Z0)=(n_pl @ Z1 @ Z2)))))), inference(apply_def,[status(thm)],[c_0_14, c_0_15])).
0.42/0.81	thf(c_0_18, plain, ((iii)=(^[Z0/* 19 */:$i, Z1:$i]:((l_some @ nat @ (^[Z2/* 3 */:$i]:((((Z1)=(n_pl @ Z0 @ Z2))))))))), inference(fof_simplification,[status(thm)],[def_iii])).
0.42/0.81	thf(c_0_19, plain, ((all_of)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(fof_simplification,[status(thm)],[def_all_of])).
0.42/0.81	thf(c_0_20, plain, ((is_of)=(^[Z0/* 19 */:$i, Z1:$i > $o]:((Z1 @ Z0)))), inference(fof_simplification,[status(thm)],[def_is_of])).
0.42/0.81	thf(c_0_21, plain, ((n_eq)=(^[Z0/* 19 */:$i, Z1:$i]:((((n_ts @ (num @ Z0) @ (den @ Z1))=(n_ts @ (num @ Z1) @ (den @ Z0))))))), inference(fof_simplification,[status(thm)],[def_n_eq])).
0.42/0.81	thf(c_0_22, plain, ((moref)=(^[Z0/* 19 */:$i, Z1:$i]:(((l_some @ nat @ (^[Z2/* 3 */:$i]:((((n_ts @ (num @ Z0) @ (den @ Z1))=(n_pl @ (n_ts @ (num @ Z1) @ (den @ Z0)) @ Z2)))))))))), inference(fof_simplification,[status(thm)],[def_moref])).
0.42/0.81	thf(c_0_23, plain, ((d_29_ii)=(^[Z0/* 19 */:$i, Z1:$i]:((l_some @ nat @ (^[Z2/* 3 */:$i]:((((Z0)=(n_pl @ Z1 @ Z2))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_16, c_0_17]), def_n_some])).
0.42/0.81	thf(c_0_24, plain, ((lessf)=(^[Z0/* 19 */:$i, Z1:$i]:(((l_some @ nat @ (^[Z2/* 3 */:$i]:((((n_ts @ (num @ Z1) @ (den @ Z0))=(n_pl @ (n_ts @ (num @ Z0) @ (den @ Z1)) @ Z2)))))))))), inference(fof_simplification,[status(thm)],[def_lessf])).
0.42/0.81	thf(c_0_25, plain, ((iii)=(^[Z0/* 19 */:$i, Z1:$i]:((l_some @ nat @ (^[Z2/* 3 */:$i]:((((Z1)=(n_pl @ Z0 @ Z2))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_18, c_0_17]), def_n_some])).
0.42/0.81	thf(c_0_26, plain, ((all_of)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(apply_def,[status(thm)],[c_0_19, c_0_20])).
0.42/0.81	thf(c_0_27, plain, ((n_eq)=(^[Z0/* 19 */:$i, Z1:$i]:((((n_ts @ (num @ Z0) @ (den @ Z1))=(n_ts @ (num @ Z1) @ (den @ Z0))))))), inference(apply_def,[status(thm)],[c_0_21, c_0_15])).
0.42/0.81	thf(c_0_28, plain, ((moref)=(^[Z0/* 19 */:$i, Z1:$i]:(((l_some @ nat @ (^[Z2/* 3 */:$i]:((((n_ts @ (num @ Z0) @ (den @ Z1))=(n_pl @ (n_ts @ (num @ Z1) @ (den @ Z0)) @ Z2)))))))))), inference(apply_def,[status(thm)],[c_0_22, c_0_23])).
0.42/0.81	thf(c_0_29, plain, ((lessf)=(^[Z0/* 19 */:$i, Z1:$i]:(((l_some @ nat @ (^[Z2/* 3 */:$i]:((((n_ts @ (num @ Z1) @ (den @ Z0))=(n_pl @ (n_ts @ (num @ Z0) @ (den @ Z1)) @ Z2)))))))))), inference(apply_def,[status(thm)],[c_0_24, c_0_25])).
0.42/0.81	thf(c_0_30, plain, ![X599:$i]:(((in @ X599 @ frac)=>![X598:$i]:(((in @ X598 @ frac)=>![X597:$i]:(((in @ X597 @ frac)=>![X596:$i]:(((in @ X596 @ frac)=>((l_some @ nat @ (^[Z0/* 3 */:$i]:(((n_ts @ (num @ X599) @ (den @ X598))=(n_pl @ (n_ts @ (num @ X598) @ (den @ X599)) @ Z0)))))=>(((n_ts @ (num @ X599) @ (den @ X597))=(n_ts @ (num @ X597) @ (den @ X599)))=>(((n_ts @ (num @ X598) @ (den @ X596))=(n_ts @ (num @ X596) @ (den @ X598)))=>(l_some @ nat @ (^[Z0/* 3 */:$i]:(((n_ts @ (num @ X597) @ (den @ X596))=(n_pl @ (n_ts @ (num @ X596) @ (den @ X597)) @ Z0)))))))))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz44]), c_0_26]), c_0_27]), c_0_28])])).
0.42/0.81	thf(c_0_31, negated_conjecture, ~(![X508:$i]:(((in @ X508 @ frac)=>![X507:$i]:(((in @ X507 @ frac)=>![X506:$i]:(((in @ X506 @ frac)=>![X505:$i]:(((in @ X505 @ frac)=>((l_some @ nat @ (^[Z0/* 3 */:$i]:(((n_ts @ (num @ X507) @ (den @ X508))=(n_pl @ (n_ts @ (num @ X508) @ (den @ X507)) @ Z0)))))=>(((n_ts @ (num @ X508) @ (den @ X506))=(n_ts @ (num @ X506) @ (den @ X508)))=>(((n_ts @ (num @ X507) @ (den @ X505))=(n_ts @ (num @ X505) @ (den @ X507)))=>(l_some @ nat @ (^[Z0/* 3 */:$i]:(((n_ts @ (num @ X505) @ (den @ X506))=(n_pl @ (n_ts @ (num @ X506) @ (den @ X505)) @ Z0))))))))))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz45])]), c_0_26]), c_0_29]), c_0_27])])).
0.42/0.81	thf(c_0_32, plain, ![X811:$i, X812:$i, X813:$i, X814:$i]:((~(in @ X811 @ frac)|(~(in @ X812 @ frac)|(~(in @ X813 @ frac)|(~(in @ X814 @ frac)|(~(l_some @ nat @ (^[Z0/* 3 */:$i]:(((n_ts @ (num @ X811) @ (den @ X812))=(n_pl @ (n_ts @ (num @ X812) @ (den @ X811)) @ Z0)))))|(((n_ts @ (num @ X811) @ (den @ X813))!=(n_ts @ (num @ X813) @ (den @ X811)))|(((n_ts @ (num @ X812) @ (den @ X814))!=(n_ts @ (num @ X814) @ (den @ X812)))|(l_some @ nat @ (^[Z0/* 3 */:$i]:(((n_ts @ (num @ X813) @ (den @ X814))=(n_pl @ (n_ts @ (num @ X814) @ (den @ X813)) @ Z0))))))))))))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_30])])])).
0.42/0.81	thf(c_0_33, negated_conjecture, ((in @ esk1_0 @ frac)&((in @ esk2_0 @ frac)&((in @ esk3_0 @ frac)&((in @ esk4_0 @ frac)&((l_some @ nat @ (^[Z0/* 3 */:$i]:(((n_ts @ (num @ esk2_0) @ (den @ esk1_0))=(n_pl @ (n_ts @ (num @ esk1_0) @ (den @ esk2_0)) @ Z0)))))&(((n_ts @ (num @ esk1_0) @ (den @ esk3_0))=(n_ts @ (num @ esk3_0) @ (den @ esk1_0)))&(((n_ts @ (num @ esk2_0) @ (den @ esk4_0))=(n_ts @ (num @ esk4_0) @ (den @ esk2_0)))&~(l_some @ nat @ (^[Z0/* 3 */:$i]:(((n_ts @ (num @ esk4_0) @ (den @ esk3_0))=(n_pl @ (n_ts @ (num @ esk3_0) @ (den @ esk4_0)) @ Z0)))))))))))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_31])])])).
0.42/0.81	thf(c_0_34, plain, ![X1:$i, X6:$i, X5:$i, X4:$i]:(((l_some @ nat @ (^[Z0/* 3 */:$i]:(((n_ts @ (num @ X5) @ (den @ X6))=(n_pl @ (n_ts @ (num @ X6) @ (den @ X5)) @ Z0)))))|~((in @ X1 @ frac))|~((in @ X4 @ frac))|~((in @ X5 @ frac))|~((in @ X6 @ frac))|~((l_some @ nat @ (^[Z0/* 3 */:$i]:(((n_ts @ (num @ X1) @ (den @ X4))=(n_pl @ (n_ts @ (num @ X4) @ (den @ X1)) @ Z0))))))|((n_ts @ (num @ X1) @ (den @ X5))!=(n_ts @ (num @ X5) @ (den @ X1)))|((n_ts @ (num @ X4) @ (den @ X6))!=(n_ts @ (num @ X6) @ (den @ X4))))), inference(split_conjunct,[status(thm)],[c_0_32])).
0.42/0.81	thf(c_0_35, negated_conjecture, (l_some @ nat @ (^[Z0/* 3 */:$i]:(((n_ts @ (num @ esk2_0) @ (den @ esk1_0))=(n_pl @ (n_ts @ (num @ esk1_0) @ (den @ esk2_0)) @ Z0))))), inference(split_conjunct,[status(thm)],[c_0_33])).
0.42/0.81	thf(c_0_36, negated_conjecture, (in @ esk1_0 @ frac), inference(split_conjunct,[status(thm)],[c_0_33])).
0.42/0.81	thf(c_0_37, negated_conjecture, (in @ esk2_0 @ frac), inference(split_conjunct,[status(thm)],[c_0_33])).
0.42/0.81	thf(c_0_38, negated_conjecture, ~((l_some @ nat @ (^[Z0/* 3 */:$i]:(((n_ts @ (num @ esk4_0) @ (den @ esk3_0))=(n_pl @ (n_ts @ (num @ esk3_0) @ (den @ esk4_0)) @ Z0)))))), inference(split_conjunct,[status(thm)],[c_0_33])).
0.42/0.81	thf(c_0_39, negated_conjecture, ![X4:$i, X1:$i]:(((l_some @ nat @ (^[Z0/* 3 */:$i]:(((n_ts @ (num @ X1) @ (den @ X4))=(n_pl @ (n_ts @ (num @ X4) @ (den @ X1)) @ Z0)))))|((n_ts @ (num @ esk1_0) @ (den @ X4))!=(n_ts @ (num @ X4) @ (den @ esk1_0)))|((n_ts @ (num @ esk2_0) @ (den @ X1))!=(n_ts @ (num @ X1) @ (den @ esk2_0)))|~((in @ X4 @ frac))|~((in @ X1 @ frac)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34, c_0_35]), c_0_36]), c_0_37])])).
0.42/0.81	thf(c_0_40, negated_conjecture, ((n_ts @ (num @ esk1_0) @ (den @ esk3_0))=(n_ts @ (num @ esk3_0) @ (den @ esk1_0))), inference(split_conjunct,[status(thm)],[c_0_33])).
0.42/0.81	thf(c_0_41, negated_conjecture, ((n_ts @ (num @ esk2_0) @ (den @ esk4_0))=(n_ts @ (num @ esk4_0) @ (den @ esk2_0))), inference(split_conjunct,[status(thm)],[c_0_33])).
0.42/0.81	thf(c_0_42, negated_conjecture, (in @ esk3_0 @ frac), inference(split_conjunct,[status(thm)],[c_0_33])).
0.42/0.81	thf(c_0_43, negated_conjecture, (in @ esk4_0 @ frac), inference(split_conjunct,[status(thm)],[c_0_33])).
0.42/0.81	thf(c_0_44, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38, c_0_39]), c_0_40]), c_0_41]), c_0_42]), c_0_43])]), ['proof']).
0.42/0.81	# SZS output end CNFRefutation
0.42/0.81	# Parsed axioms                        : 547
0.42/0.81	# Removed by relevancy pruning/SinE    : 424
0.42/0.81	# Initial clauses                      : 133
0.42/0.81	# Removed in clause preprocessing      : 14
0.42/0.81	# Initial clauses in saturation        : 119
0.42/0.81	# Processed clauses                    : 676
0.42/0.81	# ...of these trivial                  : 13
0.42/0.81	# ...subsumed                          : 222
0.42/0.81	# ...remaining for further processing  : 441
0.42/0.81	# Other redundant clauses eliminated   : 28
0.42/0.81	# Clauses deleted for lack of memory   : 0
0.42/0.81	# Backward-subsumed                    : 5
0.42/0.81	# Backward-rewritten                   : 12
0.42/0.81	# Generated clauses                    : 6012
0.42/0.81	# ...of the previous two non-redundant : 5834
0.42/0.81	# ...aggressively subsumed             : 0
0.42/0.81	# Contextual simplify-reflections      : 2
0.42/0.81	# Paramodulations                      : 5496
0.42/0.81	# Factorizations                       : 0
0.42/0.81	# NegExts                              : 18
0.42/0.81	# Equation resolutions                 : 46
0.42/0.81	# Total rewrite steps                  : 2650
0.42/0.81	# Propositional unsat checks           : 0
0.42/0.81	#    Propositional check models        : 0
0.42/0.81	#    Propositional check unsatisfiable : 0
0.42/0.81	#    Propositional clauses             : 0
0.42/0.81	#    Propositional clauses after purity: 0
0.42/0.81	#    Propositional unsat core size     : 0
0.42/0.81	#    Propositional preprocessing time  : 0.000
0.42/0.81	#    Propositional encoding time       : 0.000
0.42/0.81	#    Propositional solver time         : 0.000
0.42/0.81	#    Success case prop preproc time    : 0.000
0.42/0.81	#    Success case prop encoding time   : 0.000
0.42/0.81	#    Success case prop solver time     : 0.000
0.42/0.81	# Current number of processed clauses  : 316
0.42/0.81	#    Positive orientable unit clauses  : 61
0.42/0.81	#    Positive unorientable unit clauses: 0
0.42/0.81	#    Negative unit clauses             : 17
0.42/0.81	#    Non-unit-clauses                  : 238
0.42/0.81	# Current number of unprocessed clauses: 5348
0.42/0.81	# ...number of literals in the above   : 31087
0.42/0.81	# Current number of archived formulas  : 0
0.42/0.81	# Current number of archived clauses   : 115
0.42/0.81	# Clause-clause subsumption calls (NU) : 25706
0.42/0.81	# Rec. Clause-clause subsumption calls : 6509
0.42/0.81	# Non-unit clause-clause subsumptions  : 154
0.42/0.81	# Unit Clause-clause subsumption calls : 317
0.42/0.81	# Rewrite failures with RHS unbound    : 0
0.42/0.81	# BW rewrite match attempts            : 23
0.42/0.81	# BW rewrite match successes           : 11
0.42/0.81	# Condensation attempts                : 676
0.42/0.81	# Condensation successes               : 0
0.42/0.81	# Termbank termtop insertions          : 198220
0.42/0.81	
0.42/0.81	# -------------------------------------------------
0.42/0.81	# User time                : 0.179 s
0.42/0.81	# System time              : 0.013 s
0.42/0.81	# Total time               : 0.192 s
0.42/0.81	# Maximum resident set size: 4980 pages
0.42/0.82	
0.42/0.82	# -------------------------------------------------
0.42/0.82	# User time                : 0.719 s
0.42/0.82	# System time              : 0.037 s
0.42/0.82	# Total time               : 0.755 s
0.42/0.82	# Maximum resident set size: 2660 pages
0.42/0.82	% E---3.1 exiting
0.42/0.82	EOF